Stabbing isothetic boxes and rectangles in O(n log n) time
نویسندگان
چکیده
منابع مشابه
Fast Stabbing of Boxes in High Dimensions
We present in this paper a simple yet e cient algorithm for stabbing a set S of n axisparallel boxes in d-dimensional space with c(S) points in output-sensitive time O(dn log c(S)) and linear space. Let c∗(S) and b∗(S) be, respectively, the minimum number of points required to stab S and the maximum number of pairwise disjoint boxes of S. We prove that b(S)6c(S)6c(S)6b(S)(1+log2 b ∗(S))d−1. Sin...
متن کاملParameterized Complexity of Stabbing Rectangles and Squares in the Plane
The NP-complete geometric covering problem Rectangle Stabbing is defined as follows: Given a set of horizontal and vertical lines in the plane, a set of rectangles in the plane, and a positive integer k, select at most k of the lines such that every rectangle is intersected by at least one of the selected lines. While it is known that the problem can be approximated in polynomial time with a fa...
متن کاملConvex Hull with Optimal Query Time and O ( log n · log log n ) Update Time
The dynamic maintenance of the convex hull of a set of points in the plane is one of the most important problems in computational geometry. We present a data structure supporting point insertions in amortized O(log n · log log logn) time, point deletions in amortized O(log n · log logn) time, and various queries about the convex hull in optimal O(log n) worst-case time. The data structure requi...
متن کاملKlee’s Measure Problem on Fat Boxes in Time O(n)
The measure problem of Klee asks for the volume of the union of n axis-parallel boxes in a fixed dimension d. We give an O(n) time algorithm for the special case of all boxes being cubes or, more generally, fat boxes. Previously, the fastest run-time was n 2O(log ∗ , achieved by the general case algorithm of Chan [SoCG 2008]. For the general problem our run-time would imply a complexity theoret...
متن کاملAn Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles
In this paper we face the problem of computing a conservative approximation of a set of isothetic rectangles in the plane by means of a pair of enclosing isothetic rectangles. We propose an O(n log n) time algorithm for nding, given a set M of n isothetic rectangles, a pair of isothetic rectangles (s; t) such that s and t enclose all rectangles of M and area(s) + area(t) is minimal. Moreover we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1992
ISSN: 0925-7721
DOI: 10.1016/0925-7721(92)90022-k